Adjoining appropriate singular elements to transport theory computations

Large Scale Sparse Singular Value Computations

In this paper, we present four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We particularly emphasize Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left-and right-singular vectors) for sparse matrices arising from two pra...

Tree Adjoining Grammars: Formal Theory and Applications

Phase theory and Tree Adjoining Grammar

The phase-based approach to grammatical derivation and one rooted in the Tree Adjoining Grammar (TAG) formalism share the idea that the derivation of a complex sentence is divided into separate derivations of local domains. These approaches differ, however, in their treatment of syntactic dependencies spanning across such local domains. Under the phase approach, operations in a higher domain ca...

Tree-adjoining Grammars for Optimality Theory Syntax

This paper explores an optimality-theoretic approach to syntax based on Tree-Adjoining Grammars (TAG), where two separate optimizations are responsible for the construction of local pieces of tree structure (elementary trees) and the combination of these pieces of structure. The local optimization takes a non-recursive predicate-argument structure (PA-chunk) as an underlying representation and ...

Adjoining Idempotents to Semigroups

Our paper is inspired by the paper [3] by M. Nathanson, in which he considers iteration of the process of adjoining identities or zeros to semigroups and characterizes the resulting semigroup in the case when one starts with the trivial semigroup. We consider also the third type of adjoining, namely, we adjoin idempotents “that behave like some already existing elements.” We investigate the pro...